Partial First-order Logic with Approximative Functors Based on Properties

نویسنده

  • Tamás Mihálydeák
چکیده

In the present paper a logically exact way is presented in order to define approximative functors on object level in the partial first–order logic relying on approximation spaces. By the help of defined approximative functors one can determine what kind of approximations has to be taken into consideration in the evaluating process of a formula. The representations of concepts (properties) of our available knowledge can be used to approximate not only any concept (property) but any relation. In the last section lower and upper characteristic matrixes are introduced. These can be very useful in different applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some unexpected properties of partial propositional logic based on partial approximation space

Rough set theory can be considered as the foundation of various kinds of deductive reasoning. In this paper, the authors do some logical investigations about the possibility of using partial approximation of sets as semantics of a three-valued partial logic which use one-argument predicate parameters without quantification. As a consequence of using the lower and upper approximation of sets, ap...

متن کامل

Representations of First Order Function Types as Terminal Coalgebras

We show that function types which have only initial algebras for regular functors in the domains, i.e. first order function types, can be represented by terminal coalgebras for certain nested functors. The representation exploits properties of ω-limits and local ω-colimits.

متن کامل

Model Checking Communicating Processes: Run Graphs, Graph Grammars, and MSO

The formal model of recursive communicating processes (RCPS) is important in practice but does not allows to derive decidability results for model checking questions easily. We focus a partial order representation of RCPS’s execution by graphs—so called run graphs, and suggest an under-approximative verification approach based on a bounded-treewidth requirement. This allows to directly derive p...

متن کامل

A Higher-order Module Discipline with Separate Compilation, Dynamic Linking, and Pickling

We present a higher-order module discipline with separate compilation and concurrent dynamic linking. Based on first-order modules one can program security policies for systems that link modules from untrusted locations (e.g., Java). We introduce a pickling operation that writes persistent clones of volatile, possibly higher-order data structures on the file system. Our pickling operation respe...

متن کامل

Partial second-order subdifferentials of -prox-regular functions

Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2  functions. The class of prox-regular functions covers all convex functions, lower C2  functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012